package hot100.logos91To100;

/**
 * @author logos
 * date 2025/7/18 19:12
 * @version v1.0
 * @Package hot100.logos91To100
 */
public class logos92 {

    /**
     * 92. 最小路径和
     * https://leetcode.cn/problems/minimum-path-sum/description/?envType=study-plan-v2&envId=top-100-liked
     */

    class Solution {
        public int minPathSum(int[][] grid) {
            int n = grid.length;
            int m = grid[0].length;
            int[][] dp = new int[n][m];
            dp[0][0] = grid[0][0];
            for (int i = 1; i < n; i++) {
                dp[i][0] = grid[i][0] + dp[i - 1][0];
            }
            for (int j = 1; j < m; j++) {
                dp[0][j] = grid[0][j] + dp[0][j - 1];
            }
            for (int i = 1; i < n; i++) {
                for (int j = 1; j < m; j++) {
                    dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
                }
            }
            return dp[n - 1][m - 1];
        }
    }
}
